Alphabetic Minimax Trees of Degree at Most t*

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction

Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

With the aid of a new graph-colouring theorem, we give a simple explicit construction for generalized n-connectors with 2k - 1 stages and O( n1 + 1 / k (log n )( k - 1)/ 2 ) edges. This is asymptotically the best explicit construction known for generalized connectors

On Monotone Formulae with Restricted Depth

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with Πk-formulae of size n for which every Σk-formula has size exp Ω(n1/(k-1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a Σk-formula of size exp O(n1/(k-1)). Thus our hierarchy theorem is the best possible

Reduction Techniques for Graph Isomorphism in the Context of Width Parameters

We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an isomorphism invariant set of potential bags for a decomposition and then apply a restricted version of the Weisfeiler-Lehman algorithm to solve isomorphism. With this we show fixed-parameter tractability for several parameters and provide a unified explanation for various isomorphism results concerned with parameters related to tree decompositions. As a possibly first step towards intractability results for parameterized graph isomorphism we develop an fpt Turing-reduction from strong tree width to the a priori unrelated parameter maximum degree.Comment: 23 pages, 4 figure

Autonomic Phenotypes in Chronic Fatigue Syndrome (CFS) Are Associated with Illness Severity: A Cluster Analysis

In this study we set out to define the characteristics of autonomic subgroups of patients with Chronic Fatigue Syndrome (CFS). The study included 131 patients with CFS (Fukuda criteria). Participants completed the following screening symptom assessment tools: Chalder Fatigue Scale, Fatigue Impact Scale, Fatigue Severity Scale, Epworth Sleepiness Scales, the self-reported Composite Autonomic Symptom Scale. Autonomic parameters were measured at rest with a Task Force Monitor (CNS Systems) and arterial stiffness using an Arteriograph (TensioMed Kft.). Principal axis factor analysis yielded four factors: fatigue, subjective and objective autonomic dysfunction and arterial stiffness. Using cluster analyses, these factors were grouped in four autonomic profiles: 34% of patients had sympathetic symptoms with dysautonomia, 5% sympathetic alone, 21% parasympathetic and 40% had issues with sympathovagal balance. Those with a sympathetic-dysautonomia phenotype were associated with more severe disease, reported greater subjective autonomic symptoms with sympathetic over-modulation and had the lowest quality of life. The highest quality of life was observed in the balance subtype where subjects were the youngest, ha

Computing: report leaps geographical barriers but stumbles over gender

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/62917/1/441025a.pd

A basic analysis toolkit for biological sequences

This paper presents a software library, nicknamed BATS, for some basic sequence analysis tasks. Namely, local alignments, via approximate string matching, and global alignments, via longest common subsequence and alignments with affine and concave gap cost functions. Moreover, it also supports filtering operations to select strings from a set and establish their statistical significance, via z-score computation. None of the algorithms is new, but although they are generally regarded as fundamental for sequence analysis, they have not been implemented in a single and consistent software package, as we do here. Therefore, our main contribution is to fill this gap between algorithmic theory and practice by providing an extensible and easy to use software library that includes algorithms for the mentioned string matching and alignment problems. The library consists of C/C++ library functions as well as Perl library functions. It can be interfaced with Bioperl and can also be used as a stand-alone system with a GUI. The software is available at under the GNU GPL

Insight into aquaculture's potential of marine annelid worms and ecological concerns: a review

Polychaetes are marine annelid worms that can contribute to aquaculture diversification. Its culture has been viable, and commercially attempted, but intensive production has progressed only in few countries around the world. In the countries with no production, marine polychaetes are imported or harvested. A strong and sustained research investment provided to a better understanding of the nutritional requirements and reproduction of some species. Recent studies showed new technical improvements, which can lead to an important progress in productivity and give a new impetus to the polychaete production. Some marine worm species were identified as good candidates for integrated multitrophic aquaculture. The development of cost-effective aquaculture techniques for marine annelid worms is essential to ensure a balance between commercial interests and the preservation of ecosystems. The influence of polychaete aquaculture on the environment and vice versa raise important concerns related to ecological security and sustainability of this activity. This review focus on the main technical improvements and advances that have been made in areas as diverse as: aquaculture potential of polychaetes, reared species, main species used worldwide, and highlights biological and ecological concerns, important challenges and recommendations.This study was supported by the FCT (Portuguese National Board of Scientific Research), through the MARE (Marine and Environmental Sciences Centre) (UID/MAR/04292/2013) strategic programme and through strategic project PEst-OE/MAR/UI0199/2014, granted to MARE. This study has also the financial support of PROMAR Program through the project 31-03-05-FEP42: LIVE BAIT – Annelid polychaetes as live bait in Portugal: harvesting, import and rearing management.info:eu-repo/semantics/publishedVersio

A Polychaete’s Powerful Punch: Venom Gland Transcriptomics of Glycera Reveals a Complex Cocktail of Toxin Homologs

© The Author(s) 2014. Published by Oxford University Press on behalf of the Society for Molecular Biology and Evolution. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited. The article attached is the publisher's pdf